Undecidability of performance equivalence of Petri nets

Decidability Questions for Bismilarity of Petri Nets and Some Related Problems

The main result is undecidability of bisimilarity for labelled (place/transition) Petri nets. The same technique applies to the (preex) language equivalence and reachability set equality, which yields stronger versions with simpler proofs of already known results. The paper also shows decidability of bisimilarity if one of the nets is deterministic up to bisimilarity. Another decidability resul...

Soccer Goalkeeper Task Modeling and Analysis by Petri Nets

In a robotic soccer team, goalkeeper is an important challenging role, which has different characteristics from the other teammates. This paper proposes a new learning-based behavior model for a soccer goalkeeper robot by using Petri nets. The model focuses on modeling and analyzing, both qualitatively and quantitatively, for the goalkeeper role so that we have a model-based knowledge of the ta...

Modeling and Performance Evaluation of Energy Consumption in S-MAC Protocol Using Generalized Stochastic Petri Nets

One of the features of wireless sensor networks is that the nodes in this network have limited power sources. Therefore, assessment of energy consumption in these networks is very important. What has been common practice has been the use of traditional simulators to evaluate the energy consumption of the nodes in these networks. Simulators often have problems such as fluctuating output values i...

Reachable Markings of Object Petri Nets

In this article I will prove undecidability results for elementary object net systems (Eos). Object nets are Petri nets which have Petri nets as tokens – an approach which is called the “nets-within-nets” paradigm. Eos are special object net system which have a two leveled structure.

Undecidability in Object-Oriented Petri Nets